Ramsey numbers for small graphs versus small disconnected graphs
نویسندگان
چکیده
The Ramsey number r(G,H) is determined for all disconnected (isolatefree) graphs H of order six and all graphs G of order at most five, except the three cases (G,H) ∈ {(K5 − 2K2, 2K3), (K5 − e, 2K3), (K5, 2K3)} where bounds with difference 1 are established. Moreover, general results are obtained for some small disconnected graphs H and any graph G.
منابع مشابه
The Ramsey numbers of large trees versus wheels
For two given graphs G1 and G2, the Ramseynumber R(G1,G2) is the smallest integer n such that for anygraph G of order n, either $G$ contains G1 or the complementof G contains G2. Let Tn denote a tree of order n andWm a wheel of order m+1. To the best of our knowledge, only R(Tn,Wm) with small wheels are known.In this paper, we show that R(Tn,Wm)=3n-2 for odd m with n>756m^{10}.
متن کاملRamsey Numbers of K M versus (n; K)-graphs and the Local Density of Graphs Not Containing a K M
In this paper generalized Ramsey numbers of complete graphs K m versus the set h; n; ki of (n; k)-graphs are investigated. The value of r(K m ; hn; ki) is given in general for (relative to n) values of k small compared to n using a correlation with Turr an numbers. These generalized Ramsey numbers can be used to determine the local densities of graphs not containing a subgraph K m .
متن کاملRestricted size Ramsey number for path of order three versus graph of order five
Let G and H be simple graphs. The Ramsey number r(G,H) for a pair of graphs G and H is the smallest number r such that any red-blue coloring of the edges of Kr contains a red subgraph G or a blue subgraph H . The size Ramsey number r̂(G,H) for a pair of graphs G and H is the smallest number r̂ such that there exists a graph F with size r̂ satisfying the property that any red-blue coloring of the e...
متن کاملRamsey numbers for bipartite graphs with small bandwidth
We estimate Ramsey numbers for bipartite graphs with small bandwidth and bounded maximum degree. In particular we determine asymptotically the two and three color Ramsey numbers for grid graphs. More generally, we determine the two color Ramsey number for bipartite graphs with small bandwidth and bounded maximum degree and the three color Ramsey number for such graphs with the additional assump...
متن کاملOn the Ramsey numbers for linear forest versus some graphs
For given graphs G and H; the Ramsey number R(G;H) is the leastnatural number n such that for every graph F of order n the followingcondition holds: either F contains G or the complement of F contains H.In this paper firstly, we determine Ramsey number for union of pathswith respect to sunflower graphs, For m ≥ 3, the sunflower graph SFmis a graph on 2m + 1 vertices obtained...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 51 شماره
صفحات -
تاریخ انتشار 2011